Generating Provable Primes Efficiently on Embedded Devices

نویسندگان

  • Christophe Clavier
  • Benoit Feix
  • Loïc Thierry
  • Pascal Paillier
چکیده

This paper introduces new techniques to generate provable prime numbers efficiently on embedded devices such as smartcards, based on variants of Pocklington’s and the Brillhart-Lehmer-Selfridge-TuckermanWagstaff theorems. We introduce two new generators that, combined with cryptoprocessor-specific optimizations, open the way to efficient and tamper-resistant on-board generation of provable primes. We also report practical results from our implementations. Both our theoretical and experimental results show that constructive methods can generate provable primes essentially as efficiently as state-of-the-art generators for probable primes based on Fermat and Miller-Rabin pseudo-tests. We evaluate the output entropy of our two generators and provide techniques to ensure a high level of resistance against physical attacks. This paper intends to provide practitioners with the first practical solutions for fast and secure generation of provable primes in embedded security devices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on efficient implementation of prime generation algorithms in small portable devices

This paper investigates existing prime generation algorithms on small portable devices, makes optimizations and compares their efficiencies. It shows by comparing the performances that the bit array algorithm is the most efficient among all the existing prime generation algorithms. The paper further optimizes the implementation of the bit array algorithm by using an optimal parameter in the pri...

متن کامل

On bounded arithmetic augmented by the ability to count certain sets of primes

Over 25 years ago, the first author conjectured in [15] that the existence of arbitrarily large primes is provable from the axioms IΔ0( ) + def( ), where (x) is the number of primes not exceeding x, IΔ0( ) denotes the theory of Δ0 induction for the language of arithmetic including the new function symbol , and def( ) is an axiom expressing the usual recursive definition of . We prove a modified...

متن کامل

Finding Primitive Roots Pseudo-Deterministically

Pseudo-deterministic algorithms are randomized search algorithms which output unique solutions (i.e., with high probability they output the same solution on each execution). We present a pseudo-deterministic algorithm that, given a prime p, finds a primitive root modulo p in time exp(O( p log p log log p)). This improves upon the previous best known provable deterministic (and pseudo-determinis...

متن کامل

SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags

We describe a new function called SQUASH (which is short for SQU are-hASH ), which is ideally suited to challenge-response MAC applications in highly constrained devices such as RFID tags. It is exceptionally simple, requires no source of random bits, and can be efficiently implemented on processors with arbitrary word sizes. Unlike other ad-hoc proposals which have no security analysis, SQUASH...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012